Quantum Games: a theoretical formalism

We pursue a general theory of quantum games. We show that quantum games are more efficient than classical games, and provide a saturated upper bound for this efficiency. We also demonstrate how quantum games may be viewed simultaneously as both a generalized and yet restricted version of the corresponding classical games. We also deduce the quantum version of the Minimax Theorem and the Nash Equilibrium Theorem. [email protected] [email protected]